Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
521	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
522	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Planar graphs Hamiltonian path Polyhedron Dodecahedron Graph theory Theoretical computer science Mathematics
523	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:20 Planar graphs Graph Unit disk graph Planar straight-line graph P Geographic routing Graph theory Theoretical computer science NP-complete problems
524	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1) Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:51 Hamiltonian path Graph coloring Graph Path decomposition Edge coloring Graph theory Planar graphs NP-complete problems
525	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Packing Plane Spanning Trees and Paths in Complete Geometric Graphs∗ Oswin Aichholzer† Thomas Hackl† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 19:34:00 Spanning tree Matroid theory Tree Planar graph Graph Geometric graph theory Matching Minimum spanning tree Petersen graph Graph theory Mathematics Theoretical computer science
526	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
527	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
528	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
529	16th Canadian Conference on Computational Geometry, 2004 On Sequential Triangulations of Simple Polygons Robin Flatland Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 NP-complete problems Hamiltonian path Vertex Triangle strip Degree Graph theory Mathematics Theoretical computer science
530	IEEE International Conference on Data Engineering Progressive Keyword Search in Relational Databases Guoliang Li† † Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-01-09 09:42:51 Spanning tree NP-complete problems Network theory Steiner tree problem Minimum spanning tree Connectivity Tree Graph Shortest path problem Graph theory Theoretical computer science Mathematics

UPDATE